An Ant Colony Optimization Method with Local Search for Stability Analysis of Linear Time-invariant Time- Delay Systems
نویسندگان
چکیده
A hybrid search method based on Ant Colony Optimization for Continuous Domains ( ACO ) and the Nelder-Mead Simplex algorithm is proposed to calculate the stability margin of linear time-invariant time-delay systems. The effectiveness of the Nelder-Mead Simplex procedure is combined with the global search power of the ACO method to obtain the stability margin of linear timeinvariant time-delay systems. Also, the problem is formulated in a way that results in a constant-dimension search space (the complex plane) regardless of the order of the system. Simulation results indicate successful assessment of stability for the systems under examination.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDelay-dependent stability for transparent bilateral teleoperation system: an LMI approach
There are two significant goals in teleoperation systems: Stability and performance. This paper introduces an LMI-based robust control method for bilateral transparent teleoperation systems in presence of model mismatch. The uncertainties in time delay in communication channel, task environment and model parameters of master-slave systems is called model mismatch. The time delay in communicatio...
متن کاملA hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملBilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control
This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...
متن کامل